Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3

نویسندگان

  • Matthew Amy
  • Olivia Di Matteo
  • Vlad Gheorghiu
  • Michele Mosca
  • Alex Parent
  • John M. Schanck
چکیده

Matthew Amy,1, 2 Olivia Di Matteo,1, 3 Vlad Gheorghiu,1, 4, ∗ Michele Mosca,1, 4, 5, 6 Alex Parent,1, 3 and John Schanck1, 4 Institute for Quantum Computing, University of Waterloo, Waterloo, ON, N2L 3G1, Canada David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada Department of Physics & Astronomy, University of Waterloo, Waterloo, ON, N2L 3G1, Canada Department of Combinatorics & Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada Perimeter Institute for Theoretical Physics, Waterloo, ON, N2L 6B9, Canada Canadian Institute for Advanced Research, Toronto, ON, M5G 1Z8, Canada

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxed Differential Fault Analysis of SHA-3

In this paper, we propose a new method of differential fault analysis of SHA-3 which is based on the differential relations of the algorithm. Employing those differential relations in the fault analysis of SHA-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state...

متن کامل

Quantum Preimage and Collision Attacks on CubeHash

In this paper we show a quantum preimage attack on CubeHash-512-normal with complexity 2. This kind of attack is expected to cost 2 for a good 512-bit hash function, and we argue that this violates the expected security of CubeHash. The preimage attack can also be used as a collision attack, given that a generic quantum collision attack on a 512-bit hash function require 2 operations, as explai...

متن کامل

Enhancing the Security Level of SHA-1 by Replacing the MD Paradigm

Cryptographic hash functions are important cryptographic techniques and are used widely in many cryptographic applications and protocols. All the MD4 design based hash functions such as MD5, SHA-0, SHA-1 and RIPEMD-160 are built on Merkle-Damgård iterative method. Recent differential and generic attacks against these popular hash functions have shown weaknesses of both specific hash functions a...

متن کامل

Generic Collision Attacks on Narrow-pipe Hash Functions Faster than Birthday Paradox, Applicable to MDx, SHA-1, SHA-2, and SHA-3 Narrow-pipe Candidates

In this note we show a consequence of the recent observation that narrow-pipe hash designs manifest an abberation from ideal random functions for finding collisions for those functions with complexities much lower than the so called generic birthday paradox lower bound. The problem is generic for narrow-pipe designs including classic Merkle-Damg̊ard designs but also recent narrow-pipe SHA-3 cand...

متن کامل

Quantum attacks against Blue Midnight Wish, ECHO, Fugue, Grøstl, Hamsi, JH, Keccak, Shabal, SHAvite-3, SIMD, and Skein

This paper presents attacks that clearly violate the explicit security claims of 11 of the 14 second-round submissions to the SHA-3 competition: Blue Midnight Wish, ECHO, Fugue, Grøstl, Hamsi, JH, Keccak, Shabal, SHAvite-3, SIMD, and Skein. The attacks are structured-first-preimage attacks, the most devastating type of hash-function attack. The attacks use a quantum computer, but not a particul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016